-
1 алгоритм
algorithm, device, procedure, scheme, strategy, technique* * *алгори́тм м.
algorithmконструи́ровать алгори́тм — synthesize an algorithmпо ( такому-то) [m2]алгори́тму — by a (so and so) program [algorithm]распи́сывать алгори́тм в … (напр. команды) — break down an algorithm in … (e. g., commands)
(с)формулировать алгори́тм — develop an algorithmалгори́тм выполне́ния — execution [performance] algorithmвычисли́тельный алгори́тм — computational algorithmдекоди́рующий алгори́тм — decoding algorithmалгори́тм деле́ния Эвкли́да — Euclidean division algorithmдетермини́рованный алгори́тм — deterministic algorithmалгори́тм Ква́йна — Quine algorithmлоги́ческий алгори́тм — logical algorithmлока́льный алгори́тм — local algorithmалгори́тм Мак-Кла́ски — McCluskey algorithmнорма́льный алгори́тм — normal algorithmобобщё́нный алгори́тм — generalized algorithmалгори́тм обуче́ния распознава́ния — pattern-recognition algorithmалгори́тм перево́да1. ( до ввода в машину) translation algorithm2. ( в ходе работы программы) interpretation algorithmпосле́довательный алгори́тм — sequential algorithmалгори́тм По́ста — Post algorithmпо́стовский алгори́тм см. алгоритм Постаалгори́тм приведе́ния — reduction algorithmалгори́тм распределе́ния — scheduling algorithmрекурси́вный алгори́тм — recursive algorithmсамоизменя́ющийся алгори́тм — self-adaptive algorithmалгори́тм сложе́ния — addition algorithmалгори́тм с непо́лной па́мятью — partial-memory algorithmалгори́тм составле́ния гра́фика или расписа́ния — scheduling algorithmалгори́тм с по́лной па́мятью — full-memory algorithmтабли́чный алгори́тм — table algorithmалгори́тм трансля́ции — compilation [translation] algorithmалгори́тм Тью́ринга — Turing algorithmуниверса́льный алгори́тм — universal algorithmалгори́тм управле́ния — control algorithmалгори́тм управля́ющего устро́йства — controller algorithmчелно́чный алгори́тм — shuttle algorithmалгори́тм чи́сленного ана́лиза — numerical analysis algorithmалгори́тм Эвкли́да — Euclidean algorithmэквивале́нтные алгори́тмы — equivalent algorithmsэлемента́рный алгори́тм — elementary algorithm -
2 расписывать алгоритм в
Makarov: break down an algorithm in ( e. g., commands) (напр. команды)Универсальный русско-английский словарь > расписывать алгоритм в
-
3 desdoblar
v.1 to unfold (servilleta, papel).La chica desdobló su ropa The girl unfolded her clothes.2 to split.El sistema desdobla la energía The system splits the energy.3 to break down.* * *1 to unfold2 figurado (duplicar) to split* * *1. VT1) (=desplegar) [+ pañuelo] to unfold; [+ mantel] to spread out; [+ alambre] to untwist2) (Quím) to break down (en into)3) (=duplicar) to double4) [+ carretera] to widen5) [+ tema] to expand upon, explain2.See:* * *1.verbo transitivo1) <servilleta/pañuelo> to unfold2)a) < imagen> to splitb) <función/cargo> to split, divide2.desdoblarse v pron to divide into two, split into two* * *= unfold.Ex. This algorithm handles cyclic graphs without unfolding the cycles nor looping through them.----* sin desdoblarse = unfolded.* * *1.verbo transitivo1) <servilleta/pañuelo> to unfold2)a) < imagen> to splitb) <función/cargo> to split, divide2.desdoblarse v pron to divide into two, split into two* * *= unfold.Ex: This algorithm handles cyclic graphs without unfolding the cycles nor looping through them.
* sin desdoblarse = unfolded.* * *desdoblar [A1 ]vtA ‹servilleta/pañuelo› to unfoldB1 ‹imagen› to split2 ‹función/cargo› to split, divide3 ( Transp):se desdoblará el tramo entre Montoro y Villa del Río ( Auto) the section between Montoro and Villa del Río is to be converted into a four-lane highway ( AmE) o ( BrE) a dual carriagewaydesdoblaron la vía entre … ( Ferr) they laid double tracks between …to divide into two, split into two* * *
desdoblar ( conjugate desdoblar) verbo transitivo ‹servilleta/pañuelo› to unfold
desdoblarse verbo pronominal
to divide into two, split into two
' desdoblar' also found in these entries:
English:
unfold
* * *♦ vt1. [desplegar] [mantel, pañuelo, periódico] to unfold;[alambre] to straighten out2. [dividir] to split;desdoblaron el antiguo ministerio en dos nuevas carteras they divided the old ministry into two portfolios3. [carretera] to make into a Br dual carriageway o US divided highway;[ferrocarril] to make into a two-track (line)* * *v/t1 unfold2 ( dividir) split* * *desdoblar vtdesplegar: to unfold* * *desdoblar vb to unfold -
4 Отсутствие артиклей перед существительными, которые снабжены ссылками
It follows from Theorem 1 that $x=1$Section 2 of this paper gives (contains) a concise presentation of the notation to be used belowProperty 1 is called (known as) the triangle inequalityThis assertion (statement, proposition) has been proved in part 1 (part (a)) of the (our) proofAlgorithm 1 (с большой буквы) defines elementary permutations and elementary triangle matrices of index 2Equation (1) ((the) inequality (1)) can thus be written in the (артикль обязателен) form (2)In the language of our notation, algorithm (1) (с маленькой буквы) is a stable way of computing the inner productThe only place where the algorithm can break down is in statement 3 (in Statement 3)We combine Exercises 1 and 2 to construct an algorithm for finding an approximate eigenvectorThis case is illustrated in (но не on) Figure 1The asymptotic formula (1) was proved in Example 1Corollary 1 can be used to estimate the error in the inverse of a perturbed matrixBy property 1 (by Theorem 1), this function is positive except at the zero vectorA less trivial example is given in Appendix 3Step 1 in Example 1 and steps 2 and 3 in Example 2The idea of a norm will be introduced in Chapter 4Now from statements 2 and 3 of (1), we have...All the drivers for solving linear systems are listed in Table 1 (are illustrated in Figure 1)If Algorithm 1 in four-digit arithmetic is applied to refine $x$, then we obtain...Assertion (ii) is nothing but the statement that one natural way of extending these ideas to $R^n$ is to generalize formula (1) to obtain a Euclidean length of a vectorBy property 1, this function is positive except at the zero vectorWe have seen on page 3 that set of matrices is a vector space which is essentially identical with...Equation (1) effectively gives an algorithm for using the output of Algorithm 1 to solve...Русско-английский словарь по прикладной математике и механике > Отсутствие артиклей перед существительными, которые снабжены ссылками
См. также в других словарях:
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Dekker's algorithm — is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes.[1] It… … Wikipedia
Monte Carlo integration — An illustration of Monte Carlo integration. In this example, the domain D is the inner circle and the domain E is the square. Because the square s area can be easily calculated, the area of the circle can be estimated by the ratio (0.8) of the… … Wikipedia
evolution — evolutional, adj. evolutionally, adv. /ev euh looh sheuhn/ or, esp. Brit., /ee veuh /, n. 1. any process of formation or growth; development: the evolution of a language; the evolution of the airplane. 2. a product of such development; something… … Universalium
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… … Wikipedia
Arnoldi iteration — In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the eigenvalues of general (possibly non Hermitian) matrices; an analogous method for Hermitian matrices is … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Register machine — In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Contents 1 Overview 2 Formal definition 3 … Wikipedia
The Fabric of Reality — is a 1997 book by physicist David Deutsch, which expands upon his views of quantum mechanics and its meanings for understanding reality.This interpretation, or what he calls the multiverse hypothesis, is one strand of a four strand theory of… … Wikipedia